E-optimal Design in Irregular BIBD Settings
نویسندگان
چکیده
When the necessary conditions for a BIBD are satisfied, but no BIBD exists, there is no simple answer for the optimal design problem. This paper identifies the E-optimal information matrices for any such irregular BIBD setting when the number of treatments is no larger than 100. Aand D-optimal designs are typically not E-optimal. An E-optimal design for 15 treatments in 21 blocks of size 5 is found.
منابع مشابه
Construction of BIBD’s Using Quadratic Residues
Definition: Let v, k, and λ be positive integers such that v > k ≥ 2. A (v, k, λ)-balanced incomplete block design (which we abbreviate to (v, k, λ)-BIBD) is a design (X,A) such that the following properties are satisfied: 1. |X| = v, 2. Each block contains exactly k points, and 3. Every pair of distinct points is contained in exactly λ blocks. Property 3 in the definition above is the “balance...
متن کاملA 2 -code = Aane Resolvable + Bibd
We say that an A 2-code is optimum if it has the minimum cheating probabilities and the minimum sizes of keys. We rst show that an optimum A 2-code implies an aane-resolvable design. Next, we de-ne an aane-resolvable + BIBD design and prove that an optimum A 2-code is equivalent to an aane-resolvable + BIBD design.
متن کاملCombinatorial Classiication of Optimal Authentication Codes with Arbitration Satoshi Obana and Kaoru Kurosawa
Unconditionally secure authentication codes with arbitration (A 2-codes) protect against deceptions from the transmitter and the receiver as well as that from the opponent. We rst show that an optimal A 2-code implies an orthogonal array and an aane-resolvable design. Next we deene a new design, an aane-resolvable + BIBD, and prove that optimal A 2-codes are equivalent to this new design. From ...
متن کاملA few more BIBDs with k=8 or 9
It has been shown that for k = 8 or 9, there exists a BIBD(v, k, 1) for all positive integers v == 1 or k (mod k(k-1)), with some possible exceptions. We show that such designs exist for 49 of these exceptional values. A balanced incomplete block design (BIBD) with parameters (v, k, 1) is a pair (X, A) where X is a v-set and A is a family of k-subsets (where 2 < k < v) called blocks, such that ...
متن کاملPan-orientable block designs
A balanced incomplete block design BIBD(v, k, λ) is a pair (V,B) where V is a v-set (points) and B is a collection of k-subsets of V (blocks) such that each pair of elements of V occurs in exactly λ blocks. A k-tournament is a directed graph on k vertices in which there is exactly one arc between any two distinct vertices. Given a k-tournament T , we call a BIBD(v, k, 2) T -orientable if it is ...
متن کامل